Ranks of graphs : The size of acyclic orientation cover for deadlock-free packet routingKRALOVIC, R; RUZICKA, P.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 203-213, issn 0304-3975, 11 p.Article

Efficient deadlock-free multi-dimensional interval routing in interconnection networksKRALOVIC, R; ROVAN, B; RUZICKA, P et al.Lecture notes in computer science. 1998, pp 273-287, issn 0302-9743, isbn 3-540-65066-0Conference Paper

Time optimal self-stabilizing algorithmsKRALOVIC, R.Lecture notes in computer science. 1997, pp 464-472, issn 0302-9743, isbn 3-540-63774-5Conference Paper

The complexity of shortest path and dilation bounded interval routingKRALOVIC, R; RUZICKA, P; STEFANKOVIC, D et al.Lecture notes in computer science. 1997, pp 258-265, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Sparse topologies with small spectrum sizeELSÄSSER, R; KRALOVIC, R; MONIEN, B et al.Theoretical computer science. 2003, Vol 307, Num 3, pp 549-565, issn 0304-3975, 17 p.Article

The complexity of shortest path and dilation bounded interval routingKRALOVIC, R; RUZICKA, P; STEFANKOVIC, D et al.Theoretical computer science. 2000, Vol 234, Num 1-2, pp 85-107, issn 0304-3975Article

Local 7-coloring for planar subgraphs of unit disk graphsCZYZOWICZ, J; DOBREV, S; GONZALEZ-AGUILAR, H et al.Theoretical computer science. 2011, Vol 412, Num 18, pp 1696-1704, issn 0304-3975, 9 p.Conference Paper

Black hole search in common interconnection networksDOBREV, S; FLOCCHINI, P; KRALOVIC, R et al.Networks (New York, NY). 2006, Vol 47, Num 2, pp 61-71, issn 0028-3045, 11 p.Article

Black hole search in asynchronous rings using tokensDOBREV, S; KRALOVIC, R; SANTORO, N et al.Lecture notes in computer science. 2006, pp 139-150, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Interval routing on layered cross product of trees and cyclesKRALOVIC, R; ROVAN, B; RUZICKA, P et al.Lecture notes in computer science. 1999, pp 1231-1239, issn 0302-9743, isbn 3-540-66443-2Conference Paper